Regularity and planarity of token graphs
نویسندگان
چکیده
منابع مشابه
Planarity of Streamed Graphs
In this paper we introduce a notion of planarity for graphs that are presented in a streaming fashion. A streamed graph is a stream of edges e1, e2, . . . , em on a vertex set V . A streamed graph is ω-stream planar with respect to a positive integer window size ω if there exists a sequence of planar topological drawings Γi of the graphs Gi = (V, {ej | i ≤ j < i + ω}) such that the common graph...
متن کاملClustered Graphs and C-planarity
In this paper, we introduce a new graph model known as clustered graphs, i.e. graphs with recursive clustering structures. This graph model has many applications in informational and mathematical sciences. In particular, we study C-planarity of clustered graphs. Given a clustered graph, the C-planarity testing problem is to determine whether the clustered graph can be drawn without edge crossin...
متن کاملVanishing Graphs, Planarity and Reggeization*
An infinite class of non-planar skeleton graphs is found to vanish in any non-abelian gauge theory. Thus, the dominance of planar graphs is enhanced, particularly in processes where some momenta are very large. (Submitted to Phys. Rev. Lett.) * This work was supported by the Department of Energy under contract number DE-AC03-76SF00515. t Permanent address: Istituto Nazionale Fisica Nucleare, Vi...
متن کاملToken Graphs
For a graph G and integer k ≥ 1, we define the token graph Fk(G) to be the graph with vertex set all k-subsets of V (G), where two vertices are adjacent in Fk(G) whenever their symmetric difference is a pair of adjacent vertices in G. Thus vertices of Fk(G) correspond to configurations of k indistinguishable tokens placed at distinct vertices of G, where two configurations are adjacent whenever...
متن کاملCircle planarity of level graphs
In this thesis we generalise the notion of level planar graphs in two directions: track planarity and radial planarity. Our main results are linear time algorithms both for the planarity test and for the computation of an embedding, and thus a drawing. Our algorithms use and generalise PQ-trees, which are a data structure for efficient planarity tests. A graph is a level graph, if it has a part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2017
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1959